runtime.timers.heap (field)

51 uses

	runtime (current package)
		proc.go#L6082: 		if len(pp.timers.heap) > 0 {
		proc.go#L6425: 			print(" runqsize=", t-h, " gfreecnt=", pp.gFree.n, " timerslen=", len(pp.timers.heap), "\n")
		time.go#L126: 	heap []timerWhen
		time.go#L169: 	ts.len.Store(uint32(len(ts.heap)))
		time.go#L266: 	if ts == nil || t != ts.heap[0].timer {
		time.go#L281: 		ts.heap[0].when = t.when
		time.go#L437: 	ts.heap = append(ts.heap, timerWhen{t, t.when})
		time.go#L438: 	ts.siftUp(len(ts.heap) - 1)
		time.go#L439: 	if t == ts.heap[0].timer {
		time.go#L522: 	t := ts.heap[0].timer
		time.go#L527: 	last := len(ts.heap) - 1
		time.go#L529: 		ts.heap[0] = ts.heap[last]
		time.go#L531: 	ts.heap[last] = timerWhen{}
		time.go#L532: 	ts.heap = ts.heap[:last]
		time.go#L718: 		if len(ts.heap) == 0 {
		time.go#L734: 		n := len(ts.heap)
		time.go#L735: 		if t := ts.heap[n-1].timer; t.astate.Load()&timerZombie != 0 {
		time.go#L741: 				ts.heap[n-1] = timerWhen{}
		time.go#L742: 				ts.heap = ts.heap[:n-1]
		time.go#L748: 		t := ts.heap[0].timer
		time.go#L776: 	if len(src.heap) > 0 {
		time.go#L780: 		for _, tw := range src.heap {
		time.go#L790: 		src.heap = nil
		time.go#L795: 		ts.len.Store(uint32(len(ts.heap)))
		time.go#L876: 	for i := 0; i < len(ts.heap); i++ {
		time.go#L877: 		tw := &ts.heap[i]
		time.go#L896: 			n := len(ts.heap)
		time.go#L897: 			ts.heap[i] = ts.heap[n-1]
		time.go#L898: 			ts.heap[n-1] = timerWhen{}
		time.go#L899: 			ts.heap = ts.heap[:n-1]
		time.go#L981: 	if len(ts.heap) > 0 {
		time.go#L983: 		for len(ts.heap) > 0 {
		time.go#L1021: 	if len(ts.heap) == 0 {
		time.go#L1024: 	tw := ts.heap[0]
		time.go#L1203: 	for i, tw := range ts.heap {
		time.go#L1211: 		if tw.when < ts.heap[p].when {
		time.go#L1212: 			print("bad timer heap at ", i, ": ", p, ": ", ts.heap[p].when, ", ", i, ": ", tw.when, "\n")
		time.go#L1216: 	if n := int(ts.len.Load()); len(ts.heap) != n {
		time.go#L1217: 		println("timer heap len", len(ts.heap), "!= atomic len", n)
		time.go#L1226: 	if len(ts.heap) == 0 {
		time.go#L1229: 		ts.minWhenHeap.Store(ts.heap[0].when)
		time.go#L1284: 	heap := ts.heap
		time.go#L1309: 	heap := ts.heap
		time.go#L1351: 	if len(ts.heap) <= 1 {
		time.go#L1354: 	for i := int(uint(len(ts.heap)-1-1) / timerHeapN); i >= 0; i-- {